Rank of Matrices with Entries from a Multiplicative Group

نویسندگان

چکیده

Abstract We establish lower bounds on the rank of matrices in which all but diagonal entries lie a multiplicative group small rank. Applying these we show that distance sets finite pointsets $\mathbb {R}^d$ generate high-rank groups and cannot contain large sumsets.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Joint and Generalized Spectral Radius of Upper Triangular Matrices with Entries in a Unital Banach Algebra

In this paper, we discuss some properties of joint spectral {radius(jsr)} and  generalized spectral radius(gsr)  for a finite set of upper triangular matrices with entries in a Banach algebra and represent relation between geometric and joint/generalized spectral radius. Some of these are in scalar matrices, but  some are different. For example for a bounded set of scalar matrices,$Sigma$, $r_*...

متن کامل

Optimal triangular decompositions of matrices with entries from residuated lattices

We describe optimal decompositions of an n m matrix I into a triangular product I 1⁄4 A / B of an n k matrix A and a k m matrix B. We assume that the matrix entries are elements of a residuated lattice, which leaves binary matrices or matrices which contain numbers from the unit interval [0,1] as special cases. The entries of I, A, and B represent grades to which objects have attributes, factor...

متن کامل

Optimal decompositions of matrices with entries from residuated lattices

We describe optimal decompositions of matrices whose entries are elements of a residuated lattice L, such as L = [0, 1]. Such matrices represent relationships between objects and attributes with the entries representing degrees to which attributes represented by columns apply to objects represented by rows. Given such an n×m object-attribute matrix I, we look for a decomposition of I into a pro...

متن کامل

determinant of the hankel matrix with binomial entries

abstract in this thesis at first we comput the determinant of hankel matrix with enteries a_k (x)=?_(m=0)^k??((2k+2-m)¦(k-m)) x^m ? by using a new operator, ? and by writing and solving differential equation of order two at points x=2 and x=-2 . also we show that this determinant under k-binomial transformation is invariant.

15 صفحه اول

Ranks of matrices with few distinct entries

An L-matrix is a matrix whose off-diagonal entries belong to a set L, and whose diagonal is zero. Let N(r, L) be the maximum size of a square L-matrix of rank at most r. Many applications of linear algebra in extremal combinatorics involve a bound on N(r, L). We review some of these applications, and prove several new results on N(r, L). In particular, we classify the sets L for which N(r, L) i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Mathematics Research Notices

سال: 2022

ISSN: ['1687-0247', '1073-7928']

DOI: https://doi.org/10.1093/imrn/rnac183